On Mutually Favorable Events

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to model mutually exclusive events based on independent causal pathways in Bayesian network models

We show that existing Bayesian network (BN) modelling techniques cannot capture the correct intuitive reasoning in the important case when a set of mutually exclusive events need to be modelled as separate nodes instead of states of a single node. A previously proposed ‘solution’, which introduces a simple constraint node that enforces mutual exclusivity, fails to preserve the prior probabiliti...

متن کامل

On mutually independent hamiltonian paths

Let P1 = 〈v1, v2, v3, . . . , vn〉 and P2 = 〈u1, u2, u3, . . . , un〉 be two hamiltonian paths of G. We say that P1 and P2 are independent if u1 = v1, un = vn , and ui = vi for 1 < i < n. We say a set of hamiltonian paths P1, P2, . . . , Ps of G between two distinct vertices are mutually independent if any two distinct paths in the set are independent. We use n to denote the number of vertices an...

متن کامل

Not Mutually Exclusive but Mutually Beneficial

There has been a long-standing debate about whether having accurate self-perceptions or holding positive illusions of self is more adaptive. This debate has recently expanded to consider the role of accuracy and bias of partner perceptions in romantic relationships. In the present study, we hypothesized that because accuracy, positivity bias, and similarity bias are likely to serve distinct fun...

متن کامل

On Mutually Orthogonal Graph-Path Squares

A decomposition { } s G G G − = 0 1 1 , , ,   of a graph H is a partition of the edge set of H into edgedisjoint subgraphs s G G G − 0 1 1 , , ,  . If i G G ≅ for all { } i s ∈ − 0,1, , 1  , then  is a decomposition of H by G. Two decompositions { } n G G G − = 0 1 1 , , ,   and { } n F F F − = 0 1 1 , , ,   of the complete bipartite graph n n K , are orthogonal if, ( ) ( ) i j E G F =...

متن کامل

On the Number of Mutually Touching Cylinders

In a three-dimensional arrangement of 25 congruent nonoverlapping infinite circular cylinders there are always two that do not touch each other.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1942

ISSN: 0003-4851

DOI: 10.1214/aoms/1177731573